Analytical Modeling for Operating System Schedulers on NUMA Systems
نویسندگان
چکیده
منابع مشابه
Analytical Modeling for Operating System Schedulers on NUMA Systems
Performance evaluation by benchmarking is one of the main approaches for measuring performance of a computer system. However, it is important to measure parts of a system before they are even implemented. This can be achieved through an analytical description of the system, allowing the analysis of the system performance. Additionally, the analytical model can be extended to consider also relia...
متن کاملModeling Operating Systems Schedulers with Multi-Stack-Queue Grammars
This original method for specifying and checking the sequences of events taking place in process scheduling brings the classical syntax-directed approach of compilation to this new area. The formal language of scheduling events cannot be speciied by BNF grammars, but we use instead the Augmented BNF grammars, which combine breadth{ rst and depth-rst derivations. Their recognizers feature one or...
متن کاملOperating System Design and Implementation 1994. Experiences with Locking in a NUMA Multiprocessor Operating System Kernel
We describe the locking architecture of a new operating system, HURRICANE, designed for large scale shared-memory multiprocessors. Many papers already describe kernel locking techniques, and some of the techniques we use have been previously described by others. However, our work is novel in the particular combination of techniques used, as well as several of the individual techniques themselve...
متن کاملEmulating Soft Real-Time Scheduling Using Traditional Operating System Schedulers
Real-time scheduling algorithms are usually only available in the kernels of real-time operating systems, and not in more general purpose operating systems, like Unix. For some soft real-time problems, a traditional operating system may be the development platform of choice. This paper addresses methods of emulating real-time scheduling algorithms on top of standard time-share schedulers. We ex...
متن کاملAIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2006
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2006.03.016